<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.5"/>
<title>Huffman-homework: C:/Users/Admin/Desktop/issue/huffman-homework/Huffman.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
  $(window).load(resizeHeight);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { searchBox.OnSelectItem(0); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectlogo"><img alt="Logo" src="mm.bmp"/></td>
  <td style="padding-left: 0.5em;">
   <div id="projectname">Huffman-homework
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.5 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
      <li><a href="globals.html"><span>File&#160;Members</span></a></li>
    </ul>
  </div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('_huffman_8h_source.html','');});
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark">&#160;</span>Variables</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="headertitle">
<div class="title">Huffman.h</div>  </div>
</div><!--header-->
<div class="contents">
<a href="_huffman_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="keyword">struct </span><a class="code" href="struct_code.html">Code</a>;</div>
<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="keyword">struct </span><a class="code" href="struct_entry.html">Entry</a>;</div>
<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;</div>
<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="keywordtype">int</span>  <a class="code" href="_huffman_8h.html#ae6da2ac39f271e327984f920396d4226">parse</a>  (<span class="keywordtype">char</span>* input);</div>
<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="keywordtype">bool</span> <a class="code" href="_huffman_8h.html#a3d514936fcd5754b4e16a701869ceba7">getBit</a> (<span class="keyword">const</span> <span class="keywordtype">void</span>* input, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> bit);</div>
<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="keywordtype">void</span> <a class="code" href="_huffman_8h.html#a28631afd535a48b8305d60824efc7a80">setBit</a> (<span class="keywordtype">void</span>* input, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> bit, <span class="keywordtype">bool</span> flag);</div>
<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;</div>
<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="keywordtype">int</span>  <a class="code" href="_huffman_8h.html#a8ea33aab4a85904900987a1e548f0d51">getFrequency</a>          (<a class="code" href="class_node.html">Node&lt;Entry&gt;</a>* array[256], <span class="keyword">const</span> <span class="keywordtype">char</span>* text);</div>
<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="keywordtype">int</span>  <a class="code" href="_huffman_8h.html#ae29f1caca63c1d4c47fe74e911f5090f">shrinkImaginaryEntrys</a> (<a class="code" href="class_node.html">Node&lt;Entry&gt;</a>* array[256]);</div>
<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;</div>
<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="keywordtype">void</span> <a class="code" href="_huffman_8h.html#acf17c7d0746b1093644b6e39073e566c">fillLetterMap</a> (std::map&lt;char, Code&gt;* map, <a class="code" href="class_node.html">Node&lt;Entry&gt;</a>* tree, <span class="keywordtype">bool</span> start,</div>
<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;                    <span class="keywordtype">char</span> base[4], <span class="keywordtype">int</span> size, <span class="keywordtype">bool</span> right);</div>
<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;</div>
<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<a class="code" href="class_node.html">Node&lt;Entry&gt;</a>* <a class="code" href="_huffman_8h.html#a9a6e1b4ccad9c9dc4bc226127b0e0ded">buildHuffmanTree</a> (<span class="keyword">const</span> <span class="keywordtype">char</span>* text);</div>
<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;</div>
<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="keywordtype">void</span> <a class="code" href="_huffman_8h.html#ad9865ee52ece530d7b3b103b0d549007">decode</a> (<a class="code" href="class_node.html">Node&lt;Entry&gt;</a>* tree, <span class="keyword">const</span> <span class="keywordtype">char</span>* text, <span class="keywordtype">char</span>* output, <span class="keywordtype">int</span> limit);</div>
<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="keywordtype">int</span>  <a class="code" href="_huffman_8h.html#abcb57a49a5b5a68e9e34c11c10f15aa9">code</a>   (<a class="code" href="class_node.html">Node&lt;Entry&gt;</a>* tree, <span class="keyword">const</span> <span class="keywordtype">char</span>* text, <span class="keywordtype">char</span>* output, <span class="keywordtype">int</span> limit);</div>
<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;</div>
<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="keywordtype">void</span> <a class="code" href="_huffman_8h.html#ae306b5fba7e8c23a8b6ab4902741d446">debugPrintTree</a> (<a class="code" href="class_node.html">Node&lt;Entry&gt;</a>* node, <span class="keywordtype">char</span> legacy[10], <span class="keywordtype">int</span> size, <span class="keywordtype">bool</span> right);</div>
<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;</div>
<div class="line"><a name="l00027"></a><span class="lineno"><a class="line" href="struct_entry.html">   27</a></span>&#160;<span class="keyword">struct </span><a class="code" href="struct_entry.html">Entry</a></div>
<div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;{</div>
<div class="line"><a name="l00029"></a><span class="lineno"><a class="line" href="struct_entry.html#ac969a3e3939cd984949ce994e740340e">   29</a></span>&#160;    <span class="keywordtype">int</span>  <a class="code" href="struct_entry.html#ac969a3e3939cd984949ce994e740340e">frequency</a>;</div>
<div class="line"><a name="l00030"></a><span class="lineno"><a class="line" href="struct_entry.html#a5b702ed596424a56ba443f8117c69dc9">   30</a></span>&#160;    <span class="keywordtype">char</span> <a class="code" href="struct_entry.html#a5b702ed596424a56ba443f8117c69dc9">letter</a>;</div>
<div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;};</div>
<div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;</div>
<div class="line"><a name="l00040"></a><span class="lineno"><a class="line" href="struct_code.html">   40</a></span>&#160;<span class="keyword">struct </span><a class="code" href="struct_code.html">Code</a></div>
<div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;{</div>
<div class="line"><a name="l00042"></a><span class="lineno"><a class="line" href="struct_code.html#aac1f56ad96a7c78ffb27c79ca7048541">   42</a></span>&#160;    <span class="keywordtype">int</span> <a class="code" href="struct_code.html#aac1f56ad96a7c78ffb27c79ca7048541">bits</a>;</div>
<div class="line"><a name="l00043"></a><span class="lineno"><a class="line" href="struct_code.html#aecfe676c82bcd7121c85dc9e228ef7f5">   43</a></span>&#160;    <span class="keywordtype">char</span> <a class="code" href="struct_code.html#aecfe676c82bcd7121c85dc9e228ef7f5">code</a>[4];</div>
<div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;};</div>
<div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;</div>
<div class="line"><a name="l00056"></a><span class="lineno"><a class="line" href="_huffman_8h.html#a3d514936fcd5754b4e16a701869ceba7">   56</a></span>&#160;<span class="keywordtype">bool</span> <a class="code" href="_huffman_8h.html#a3d514936fcd5754b4e16a701869ceba7">getBit</a> (<span class="keyword">const</span> <span class="keywordtype">void</span>* input, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> bit)</div>
<div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;{</div>
<div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;    <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>* byte = (<span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>*) input;</div>
<div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;</div>
<div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;    byte += bit / 8;</div>
<div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;    bit = bit % 8;</div>
<div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;</div>
<div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;    <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> compareByte = 0x80 &gt;&gt; bit;</div>
<div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;</div>
<div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;    <span class="keywordflow">return</span> compareByte &amp; *byte;</div>
<div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;}</div>
<div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;</div>
<div class="line"><a name="l00078"></a><span class="lineno"><a class="line" href="_huffman_8h.html#a28631afd535a48b8305d60824efc7a80">   78</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="_huffman_8h.html#a28631afd535a48b8305d60824efc7a80">setBit</a> (<span class="keywordtype">void</span>* input, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> bit, <span class="keywordtype">bool</span> flag)</div>
<div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;{</div>
<div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;    <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>* byte = (<span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>*) input;</div>
<div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;</div>
<div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;    byte += bit / 8;</div>
<div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;    bit = bit % 8;</div>
<div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;</div>
<div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;    <span class="keywordflow">if</span> ( flag )</div>
<div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;    {</div>
<div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;        <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> setByte = 0x80 &gt;&gt; bit;</div>
<div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;        *byte = setByte | *byte;</div>
<div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;    }</div>
<div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;    <span class="keywordflow">else</span></div>
<div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;    {</div>
<div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;        <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> setByte = 0xFF ^ ( 0x80 &gt;&gt; bit );</div>
<div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;        *byte = setByte &amp; *byte;</div>
<div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;    }</div>
<div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;}</div>
<div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;</div>
<div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;</div>
<div class="line"><a name="l00110"></a><span class="lineno"><a class="line" href="_huffman_8h.html#a8ea33aab4a85904900987a1e548f0d51">  110</a></span>&#160;<span class="keywordtype">int</span> <a class="code" href="_huffman_8h.html#a8ea33aab4a85904900987a1e548f0d51">getFrequency</a> (<a class="code" href="class_node.html">Node&lt;Entry&gt;</a>* array[256], <span class="keyword">const</span> <span class="keywordtype">char</span>* text)</div>
<div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;{</div>
<div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;    <span class="keywordflow">if</span> ( !text )</div>
<div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;        <span class="keywordflow">return</span> -1;</div>
<div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;</div>
<div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;    <span class="keywordflow">try</span></div>
<div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;    {</div>
<div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 256; i++)</div>
<div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;            array[i] = <span class="keyword">new</span> <a class="code" href="class_node.html">Node&lt;Entry&gt;</a>;</div>
<div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;    }</div>
<div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;    <span class="keywordflow">catch</span> (std::bad_alloc)</div>
<div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;    {</div>
<div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;        <span class="keywordflow">return</span> -1;</div>
<div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;    }</div>
<div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;</div>
<div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 256; i++)</div>
<div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;    {</div>
<div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;        <span class="keywordflow">if</span> ( !array[i] )</div>
<div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;            <span class="keywordflow">return</span> -1;</div>
<div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;        <span class="keywordflow">if</span> ( ! array[i]-&gt;ok() )</div>
<div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;            <span class="keywordflow">return</span> -1;</div>
<div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;        array[i]-&gt;<a class="code" href="class_node.html#a219129e2eab7455a4dd0377124c83716">getValue</a>()-&gt;<a class="code" href="struct_entry.html#ac969a3e3939cd984949ce994e740340e">frequency</a> = 0;</div>
<div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;        array[i]-&gt;<a class="code" href="class_node.html#a219129e2eab7455a4dd0377124c83716">getValue</a>()-&gt;<a class="code" href="struct_entry.html#a5b702ed596424a56ba443f8117c69dc9">letter</a> = i;</div>
<div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;    }</div>
<div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;</div>
<div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;    text--;</div>
<div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;    <span class="keywordflow">while</span> ( *++text )</div>
<div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;        array[*text]-&gt;<a class="code" href="class_node.html#a219129e2eab7455a4dd0377124c83716">getValue</a>()-&gt;<a class="code" href="struct_entry.html#ac969a3e3939cd984949ce994e740340e">frequency</a> += 1;</div>
<div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;</div>
<div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;    <span class="keywordflow">return</span> <a class="code" href="_huffman_8h.html#ae29f1caca63c1d4c47fe74e911f5090f">shrinkImaginaryEntrys</a> (array);</div>
<div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;}</div>
<div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;</div>
<div class="line"><a name="l00152"></a><span class="lineno"><a class="line" href="_huffman_8h.html#ae29f1caca63c1d4c47fe74e911f5090f">  152</a></span>&#160;<span class="keywordtype">int</span> <a class="code" href="_huffman_8h.html#ae29f1caca63c1d4c47fe74e911f5090f">shrinkImaginaryEntrys</a> (<a class="code" href="class_node.html">Node&lt;Entry&gt;</a>* array[256])</div>
<div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;{</div>
<div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;    <span class="keywordtype">int</span> write = 0;</div>
<div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 256; i++)</div>
<div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;    {</div>
<div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;        <span class="keywordflow">if</span> ( array[i]-&gt;getValue()-&gt;frequency &gt; 0 )</div>
<div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;        {</div>
<div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;            array[write] = array[i];</div>
<div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;            write++;</div>
<div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;        }</div>
<div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;        <span class="keywordflow">else</span></div>
<div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;        {</div>
<div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;            <span class="keyword">delete</span> array[i];</div>
<div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;            array[i] = <span class="keyword">nullptr</span>;</div>
<div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;        }</div>
<div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;    }</div>
<div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;    <span class="keywordflow">return</span> write;</div>
<div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;}</div>
<div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;</div>
<div class="line"><a name="l00181"></a><span class="lineno"><a class="line" href="_huffman_8h.html#a97bd49ee3670e131477f66852fb5f565">  181</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="_huffman_8h.html#a97bd49ee3670e131477f66852fb5f565">getLowest</a> (<span class="keywordtype">int</span>&amp; lowest, <span class="keywordtype">int</span>&amp; preLowest, <a class="code" href="class_node.html">Node&lt;Entry&gt;</a>* frequency[256],</div>
<div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;                <span class="keywordtype">int</span> size)</div>
<div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;{</div>
<div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; size; j++)</div>
<div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;    {</div>
<div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;        <span class="keywordflow">if</span> ( frequency[j] )</div>
<div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;        {</div>
<div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;            <span class="keywordflow">if</span> ( lowest &lt; 0 )</div>
<div class="line"><a name="l00189"></a><span class="lineno">  189</span>&#160;            {</div>
<div class="line"><a name="l00190"></a><span class="lineno">  190</span>&#160;                lowest = j;</div>
<div class="line"><a name="l00191"></a><span class="lineno">  191</span>&#160;                <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00192"></a><span class="lineno">  192</span>&#160;            }</div>
<div class="line"><a name="l00193"></a><span class="lineno">  193</span>&#160;            <span class="keywordflow">if</span> ( preLowest &lt; 0 )</div>
<div class="line"><a name="l00194"></a><span class="lineno">  194</span>&#160;            {</div>
<div class="line"><a name="l00195"></a><span class="lineno">  195</span>&#160;                <span class="keywordflow">if</span> ( frequency[lowest]-&gt;getValue()-&gt;frequency &lt;</div>
<div class="line"><a name="l00196"></a><span class="lineno">  196</span>&#160;                     frequency[  j   ]-&gt;getValue()-&gt;frequency )</div>
<div class="line"><a name="l00197"></a><span class="lineno">  197</span>&#160;                {</div>
<div class="line"><a name="l00198"></a><span class="lineno">  198</span>&#160;                    preLowest = j;</div>
<div class="line"><a name="l00199"></a><span class="lineno">  199</span>&#160;                }</div>
<div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;                <span class="keywordflow">else</span></div>
<div class="line"><a name="l00201"></a><span class="lineno">  201</span>&#160;                {</div>
<div class="line"><a name="l00202"></a><span class="lineno">  202</span>&#160;                   preLowest = lowest;</div>
<div class="line"><a name="l00203"></a><span class="lineno">  203</span>&#160;                   lowest = j;</div>
<div class="line"><a name="l00204"></a><span class="lineno">  204</span>&#160;                }</div>
<div class="line"><a name="l00205"></a><span class="lineno">  205</span>&#160;                <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00206"></a><span class="lineno">  206</span>&#160;            }</div>
<div class="line"><a name="l00207"></a><span class="lineno">  207</span>&#160;            <span class="keywordflow">if</span> ( frequency[preLowest]-&gt;getValue()-&gt;frequency &gt;</div>
<div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;                 frequency[    j    ]-&gt;getValue()-&gt;frequency )</div>
<div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;            { </div>
<div class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;                <span class="keywordflow">if</span> ( frequency[lowest]-&gt;getValue()-&gt;frequency &lt;</div>
<div class="line"><a name="l00211"></a><span class="lineno">  211</span>&#160;                     frequency[  j   ]-&gt;getValue()-&gt;frequency )</div>
<div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160;                {</div>
<div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;                    preLowest = j;</div>
<div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;                }</div>
<div class="line"><a name="l00215"></a><span class="lineno">  215</span>&#160;                <span class="keywordflow">else</span></div>
<div class="line"><a name="l00216"></a><span class="lineno">  216</span>&#160;                {</div>
<div class="line"><a name="l00217"></a><span class="lineno">  217</span>&#160;                   preLowest = lowest;</div>
<div class="line"><a name="l00218"></a><span class="lineno">  218</span>&#160;                   lowest = j;</div>
<div class="line"><a name="l00219"></a><span class="lineno">  219</span>&#160;                }</div>
<div class="line"><a name="l00220"></a><span class="lineno">  220</span>&#160;                <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;            }</div>
<div class="line"><a name="l00222"></a><span class="lineno">  222</span>&#160;        }</div>
<div class="line"><a name="l00223"></a><span class="lineno">  223</span>&#160;    }</div>
<div class="line"><a name="l00224"></a><span class="lineno">  224</span>&#160;}</div>
<div class="line"><a name="l00225"></a><span class="lineno">  225</span>&#160;</div>
<div class="line"><a name="l00235"></a><span class="lineno"><a class="line" href="_huffman_8h.html#a9a6e1b4ccad9c9dc4bc226127b0e0ded">  235</a></span>&#160;<a class="code" href="class_node.html">Node&lt;Entry&gt;</a>* <a class="code" href="_huffman_8h.html#a9a6e1b4ccad9c9dc4bc226127b0e0ded">buildHuffmanTree</a> (<span class="keyword">const</span> <span class="keywordtype">char</span>* text)</div>
<div class="line"><a name="l00236"></a><span class="lineno">  236</span>&#160;{</div>
<div class="line"><a name="l00237"></a><span class="lineno">  237</span>&#160;    <a class="code" href="class_node.html">Node&lt;Entry&gt;</a>* frequency[256] = {};</div>
<div class="line"><a name="l00238"></a><span class="lineno">  238</span>&#160;    <span class="keywordtype">int</span> size = <a class="code" href="_huffman_8h.html#a8ea33aab4a85904900987a1e548f0d51">getFrequency</a> (frequency, text);</div>
<div class="line"><a name="l00239"></a><span class="lineno">  239</span>&#160;    <span class="keywordflow">if</span> ( size == -1 )</div>
<div class="line"><a name="l00240"></a><span class="lineno">  240</span>&#160;        <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
<div class="line"><a name="l00241"></a><span class="lineno">  241</span>&#160;    <span class="keywordflow">if</span> ( size == 1 )</div>
<div class="line"><a name="l00242"></a><span class="lineno">  242</span>&#160;        <span class="keywordflow">return</span> frequency[0];</div>
<div class="line"><a name="l00243"></a><span class="lineno">  243</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt; size; i++)</div>
<div class="line"><a name="l00244"></a><span class="lineno">  244</span>&#160;    {</div>
<div class="line"><a name="l00245"></a><span class="lineno">  245</span>&#160;        <span class="keywordtype">int</span> lowest = -1;</div>
<div class="line"><a name="l00246"></a><span class="lineno">  246</span>&#160;        <span class="keywordtype">int</span> preLowest = -1;</div>
<div class="line"><a name="l00247"></a><span class="lineno">  247</span>&#160;        <a class="code" href="_huffman_8h.html#a97bd49ee3670e131477f66852fb5f565">getLowest</a> (lowest, preLowest, frequency, size);</div>
<div class="line"><a name="l00248"></a><span class="lineno">  248</span>&#160;</div>
<div class="line"><a name="l00249"></a><span class="lineno">  249</span>&#160;        <a class="code" href="class_node.html">Node&lt;Entry&gt;</a>* bridge = <span class="keyword">new</span> <a class="code" href="class_node.html">Node&lt;Entry&gt;</a>;</div>
<div class="line"><a name="l00250"></a><span class="lineno">  250</span>&#160;</div>
<div class="line"><a name="l00251"></a><span class="lineno">  251</span>&#160;        <a class="code" href="struct_entry.html">Entry</a>* value = bridge-&gt;<a class="code" href="class_node.html#a219129e2eab7455a4dd0377124c83716">getValue</a>();</div>
<div class="line"><a name="l00252"></a><span class="lineno">  252</span>&#160;        value-&gt;<a class="code" href="struct_entry.html#a5b702ed596424a56ba443f8117c69dc9">letter</a> = 0;</div>
<div class="line"><a name="l00253"></a><span class="lineno">  253</span>&#160;</div>
<div class="line"><a name="l00254"></a><span class="lineno">  254</span>&#160;        bridge-&gt;<a class="code" href="class_node.html#a83094c6b42b1d0f933bd1956c25bf99a">attatchToRight</a> (frequency[lowest]);</div>
<div class="line"><a name="l00255"></a><span class="lineno">  255</span>&#160;        bridge-&gt;<a class="code" href="class_node.html#a3d5bdc1d7ac8f69c04c533363556bff9">attatchToLeft</a>  (frequency[preLowest]);</div>
<div class="line"><a name="l00256"></a><span class="lineno">  256</span>&#160;</div>
<div class="line"><a name="l00257"></a><span class="lineno">  257</span>&#160;        frequency[lowest] = <span class="keyword">nullptr</span>;</div>
<div class="line"><a name="l00258"></a><span class="lineno">  258</span>&#160;        frequency[preLowest] = bridge;</div>
<div class="line"><a name="l00259"></a><span class="lineno">  259</span>&#160;    }</div>
<div class="line"><a name="l00260"></a><span class="lineno">  260</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i++)</div>
<div class="line"><a name="l00261"></a><span class="lineno">  261</span>&#160;        <span class="keywordflow">if</span> ( frequency[i] )</div>
<div class="line"><a name="l00262"></a><span class="lineno">  262</span>&#160;            <span class="keywordflow">return</span> frequency[i];</div>
<div class="line"><a name="l00263"></a><span class="lineno">  263</span>&#160;    <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
<div class="line"><a name="l00264"></a><span class="lineno">  264</span>&#160;}</div>
<div class="line"><a name="l00265"></a><span class="lineno">  265</span>&#160;</div>
<div class="line"><a name="l00281"></a><span class="lineno"><a class="line" href="_huffman_8h.html#acf17c7d0746b1093644b6e39073e566c">  281</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="_huffman_8h.html#acf17c7d0746b1093644b6e39073e566c">fillLetterMap</a> (std::map&lt;char, Code&gt;* map, <a class="code" href="class_node.html">Node&lt;Entry&gt;</a>* tree, <span class="keywordtype">bool</span> start,</div>
<div class="line"><a name="l00282"></a><span class="lineno">  282</span>&#160;                    <span class="keywordtype">char</span> base[4], <span class="keywordtype">int</span> size, <span class="keywordtype">bool</span> right)</div>
<div class="line"><a name="l00283"></a><span class="lineno">  283</span>&#160;{</div>
<div class="line"><a name="l00284"></a><span class="lineno">  284</span>&#160;    <span class="keywordflow">if</span> ( start )</div>
<div class="line"><a name="l00285"></a><span class="lineno">  285</span>&#160;    {</div>
<div class="line"><a name="l00286"></a><span class="lineno">  286</span>&#160;        <span class="keywordflow">if</span> ( tree-&gt;<a class="code" href="class_node.html#aec44fee5f55f7a912d398989175537a7">getLeftChild</a> () )</div>
<div class="line"><a name="l00287"></a><span class="lineno">  287</span>&#160;            <a class="code" href="_huffman_8h.html#acf17c7d0746b1093644b6e39073e566c">fillLetterMap</a> (map, tree-&gt;<a class="code" href="class_node.html#aec44fee5f55f7a912d398989175537a7">getLeftChild</a>(), <span class="keyword">false</span>, base, 0, <span class="keyword">false</span>);</div>
<div class="line"><a name="l00288"></a><span class="lineno">  288</span>&#160;        <span class="keywordflow">if</span> ( tree-&gt;<a class="code" href="class_node.html#af235020f301683c3f4ea21b526f82e63">getRightChild</a> () )</div>
<div class="line"><a name="l00289"></a><span class="lineno">  289</span>&#160;            <a class="code" href="_huffman_8h.html#acf17c7d0746b1093644b6e39073e566c">fillLetterMap</a> (map, tree-&gt;<a class="code" href="class_node.html#af235020f301683c3f4ea21b526f82e63">getRightChild</a>(), <span class="keyword">false</span>, base, 0, <span class="keyword">true</span>);</div>
<div class="line"><a name="l00290"></a><span class="lineno">  290</span>&#160;    }</div>
<div class="line"><a name="l00291"></a><span class="lineno">  291</span>&#160;    <a class="code" href="_huffman_8h.html#a28631afd535a48b8305d60824efc7a80">setBit</a> (base, size, right);</div>
<div class="line"><a name="l00292"></a><span class="lineno">  292</span>&#160;    <span class="keywordflow">if</span> ( tree-&gt;<a class="code" href="class_node.html#a219129e2eab7455a4dd0377124c83716">getValue</a>()-&gt;<a class="code" href="struct_entry.html#a5b702ed596424a56ba443f8117c69dc9">letter</a> != 0 )</div>
<div class="line"><a name="l00293"></a><span class="lineno">  293</span>&#160;    {</div>
<div class="line"><a name="l00294"></a><span class="lineno">  294</span>&#160;        <a class="code" href="struct_code.html">Code</a> <a class="code" href="_huffman_8h.html#abcb57a49a5b5a68e9e34c11c10f15aa9">code</a> = {};</div>
<div class="line"><a name="l00295"></a><span class="lineno">  295</span>&#160;        code.<a class="code" href="struct_code.html#aac1f56ad96a7c78ffb27c79ca7048541">bits</a> = size + 1;</div>
<div class="line"><a name="l00296"></a><span class="lineno">  296</span>&#160;        memcpy (code.<a class="code" href="struct_code.html#aecfe676c82bcd7121c85dc9e228ef7f5">code</a>, base, 4);</div>
<div class="line"><a name="l00297"></a><span class="lineno">  297</span>&#160;        std::pair&lt;char, Code&gt; pair = {tree-&gt;<a class="code" href="class_node.html#a219129e2eab7455a4dd0377124c83716">getValue</a>()-&gt;<a class="code" href="struct_entry.html#a5b702ed596424a56ba443f8117c69dc9">letter</a>, code};</div>
<div class="line"><a name="l00298"></a><span class="lineno">  298</span>&#160;        map-&gt;insert (pair);</div>
<div class="line"><a name="l00299"></a><span class="lineno">  299</span>&#160;    }</div>
<div class="line"><a name="l00300"></a><span class="lineno">  300</span>&#160;    <span class="keywordflow">if</span> ( tree-&gt;<a class="code" href="class_node.html#aec44fee5f55f7a912d398989175537a7">getLeftChild</a> () )</div>
<div class="line"><a name="l00301"></a><span class="lineno">  301</span>&#160;        <a class="code" href="_huffman_8h.html#acf17c7d0746b1093644b6e39073e566c">fillLetterMap</a> (map, tree-&gt;<a class="code" href="class_node.html#aec44fee5f55f7a912d398989175537a7">getLeftChild</a>(), <span class="keyword">false</span>, base, size + 1, <span class="keyword">false</span>);</div>
<div class="line"><a name="l00302"></a><span class="lineno">  302</span>&#160;    <span class="keywordflow">if</span> ( tree-&gt;<a class="code" href="class_node.html#af235020f301683c3f4ea21b526f82e63">getRightChild</a> () )</div>
<div class="line"><a name="l00303"></a><span class="lineno">  303</span>&#160;        <a class="code" href="_huffman_8h.html#acf17c7d0746b1093644b6e39073e566c">fillLetterMap</a> (map, tree-&gt;<a class="code" href="class_node.html#af235020f301683c3f4ea21b526f82e63">getRightChild</a>(), <span class="keyword">false</span>, base, size + 1, <span class="keyword">true</span>);</div>
<div class="line"><a name="l00304"></a><span class="lineno">  304</span>&#160;</div>
<div class="line"><a name="l00305"></a><span class="lineno">  305</span>&#160;}</div>
<div class="line"><a name="l00306"></a><span class="lineno">  306</span>&#160;</div>
<div class="line"><a name="l00317"></a><span class="lineno"><a class="line" href="_huffman_8h.html#ad9865ee52ece530d7b3b103b0d549007">  317</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="_huffman_8h.html#ad9865ee52ece530d7b3b103b0d549007">decode</a> (<a class="code" href="class_node.html">Node&lt;Entry&gt;</a>* tree, <span class="keyword">const</span> <span class="keywordtype">char</span>* text, <span class="keywordtype">char</span>* output, <span class="keywordtype">int</span> limit)</div>
<div class="line"><a name="l00318"></a><span class="lineno">  318</span>&#160;{</div>
<div class="line"><a name="l00319"></a><span class="lineno">  319</span>&#160;    <span class="keywordtype">int</span> size = limit;</div>
<div class="line"><a name="l00320"></a><span class="lineno">  320</span>&#160;    <a class="code" href="class_node.html">Node&lt;Entry&gt;</a>* currentTree = tree;</div>
<div class="line"><a name="l00321"></a><span class="lineno">  321</span>&#160;    <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> written = 0;</div>
<div class="line"><a name="l00322"></a><span class="lineno">  322</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; limit; i++)</div>
<div class="line"><a name="l00323"></a><span class="lineno">  323</span>&#160;    {</div>
<div class="line"><a name="l00324"></a><span class="lineno">  324</span>&#160;        <span class="keywordflow">if</span> ( currentTree-&gt;<a class="code" href="class_node.html#a2b5dbaadb5ba6ce7c0eb91d6fb3b5354">isTerminal</a> () )</div>
<div class="line"><a name="l00325"></a><span class="lineno">  325</span>&#160;        {</div>
<div class="line"><a name="l00326"></a><span class="lineno">  326</span>&#160;            output[written] = currentTree-&gt;<a class="code" href="class_node.html#a219129e2eab7455a4dd0377124c83716">getValue</a>()-&gt;<a class="code" href="struct_entry.html#a5b702ed596424a56ba443f8117c69dc9">letter</a>;</div>
<div class="line"><a name="l00327"></a><span class="lineno">  327</span>&#160;            written++;</div>
<div class="line"><a name="l00328"></a><span class="lineno">  328</span>&#160;            currentTree = tree;</div>
<div class="line"><a name="l00329"></a><span class="lineno">  329</span>&#160;        }</div>
<div class="line"><a name="l00330"></a><span class="lineno">  330</span>&#160;        <span class="keywordflow">if</span> ( <a class="code" href="_huffman_8h.html#a3d514936fcd5754b4e16a701869ceba7">getBit</a> (text, i) )</div>
<div class="line"><a name="l00331"></a><span class="lineno">  331</span>&#160;            currentTree = currentTree-&gt;<a class="code" href="class_node.html#af235020f301683c3f4ea21b526f82e63">getRightChild</a> ();</div>
<div class="line"><a name="l00332"></a><span class="lineno">  332</span>&#160;        <span class="keywordflow">else</span></div>
<div class="line"><a name="l00333"></a><span class="lineno">  333</span>&#160;            currentTree = currentTree-&gt;<a class="code" href="class_node.html#aec44fee5f55f7a912d398989175537a7">getLeftChild</a> ();</div>
<div class="line"><a name="l00334"></a><span class="lineno">  334</span>&#160;    }</div>
<div class="line"><a name="l00335"></a><span class="lineno">  335</span>&#160;}</div>
<div class="line"><a name="l00336"></a><span class="lineno">  336</span>&#160;</div>
<div class="line"><a name="l00349"></a><span class="lineno"><a class="line" href="_huffman_8h.html#abcb57a49a5b5a68e9e34c11c10f15aa9">  349</a></span>&#160;<span class="keywordtype">int</span> <a class="code" href="_huffman_8h.html#abcb57a49a5b5a68e9e34c11c10f15aa9">code</a> (<a class="code" href="class_node.html">Node&lt;Entry&gt;</a>* tree, <span class="keyword">const</span> <span class="keywordtype">char</span>* text, <span class="keywordtype">char</span>* output, <span class="keywordtype">int</span> limit)</div>
<div class="line"><a name="l00350"></a><span class="lineno">  350</span>&#160;{</div>
<div class="line"><a name="l00351"></a><span class="lineno">  351</span>&#160;    <span class="keywordtype">char</span> base[4] = <span class="stringliteral">&quot;&quot;</span>;</div>
<div class="line"><a name="l00352"></a><span class="lineno">  352</span>&#160;    std::map&lt;char, Code&gt; map;</div>
<div class="line"><a name="l00353"></a><span class="lineno">  353</span>&#160;    <a class="code" href="_huffman_8h.html#acf17c7d0746b1093644b6e39073e566c">fillLetterMap</a> (&amp;map, tree, <span class="keyword">true</span>, base, 0, <span class="keyword">true</span>);</div>
<div class="line"><a name="l00354"></a><span class="lineno">  354</span>&#160;    <span class="keywordtype">int</span> bitIndex = 0;</div>
<div class="line"><a name="l00355"></a><span class="lineno">  355</span>&#160;    <span class="keywordtype">int</span> readIndex = 0;</div>
<div class="line"><a name="l00356"></a><span class="lineno">  356</span>&#160;    <span class="keywordflow">while</span> ( text[readIndex] )</div>
<div class="line"><a name="l00357"></a><span class="lineno">  357</span>&#160;    {</div>
<div class="line"><a name="l00358"></a><span class="lineno">  358</span>&#160;        <a class="code" href="struct_code.html">Code</a> <a class="code" href="_huffman_8h.html#abcb57a49a5b5a68e9e34c11c10f15aa9">code</a> = map[text[readIndex]];</div>
<div class="line"><a name="l00359"></a><span class="lineno">  359</span>&#160;        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; code.<a class="code" href="struct_code.html#aac1f56ad96a7c78ffb27c79ca7048541">bits</a>; i++)</div>
<div class="line"><a name="l00360"></a><span class="lineno">  360</span>&#160;        {</div>
<div class="line"><a name="l00361"></a><span class="lineno">  361</span>&#160;            <a class="code" href="_huffman_8h.html#a28631afd535a48b8305d60824efc7a80">setBit</a> (output, bitIndex + i, <a class="code" href="_huffman_8h.html#a3d514936fcd5754b4e16a701869ceba7">getBit</a>(code.<a class="code" href="struct_code.html#aecfe676c82bcd7121c85dc9e228ef7f5">code</a>, i));</div>
<div class="line"><a name="l00362"></a><span class="lineno">  362</span>&#160;        }</div>
<div class="line"><a name="l00363"></a><span class="lineno">  363</span>&#160;        bitIndex += code.<a class="code" href="struct_code.html#aac1f56ad96a7c78ffb27c79ca7048541">bits</a>;</div>
<div class="line"><a name="l00364"></a><span class="lineno">  364</span>&#160;        readIndex++;</div>
<div class="line"><a name="l00365"></a><span class="lineno">  365</span>&#160;    }</div>
<div class="line"><a name="l00366"></a><span class="lineno">  366</span>&#160;    <span class="keywordflow">return</span> bitIndex + 1;</div>
<div class="line"><a name="l00367"></a><span class="lineno">  367</span>&#160;}</div>
<div class="line"><a name="l00368"></a><span class="lineno">  368</span>&#160;</div>
<div class="line"><a name="l00374"></a><span class="lineno"><a class="line" href="_huffman_8h.html#ae306b5fba7e8c23a8b6ab4902741d446">  374</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="_huffman_8h.html#ae306b5fba7e8c23a8b6ab4902741d446">debugPrintTree</a> (<a class="code" href="class_node.html">Node&lt;Entry&gt;</a>* node, <span class="keywordtype">char</span> legacy[10], <span class="keywordtype">int</span> size, <span class="keywordtype">bool</span> right)</div>
<div class="line"><a name="l00375"></a><span class="lineno">  375</span>&#160;{</div>
<div class="line"><a name="l00376"></a><span class="lineno">  376</span>&#160;    <span class="keywordtype">char</span> base[10] = <span class="stringliteral">&quot;&quot;</span>;</div>
<div class="line"><a name="l00377"></a><span class="lineno">  377</span>&#160;    memcpy (base, legacy, 10);</div>
<div class="line"><a name="l00378"></a><span class="lineno">  378</span>&#160;    <span class="keywordflow">if</span> ( size &gt;= 9 )</div>
<div class="line"><a name="l00379"></a><span class="lineno">  379</span>&#160;        <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00380"></a><span class="lineno">  380</span>&#160;    <span class="keywordflow">if</span> ( right )</div>
<div class="line"><a name="l00381"></a><span class="lineno">  381</span>&#160;        base[size] = <span class="charliteral">&#39;1&#39;</span>;</div>
<div class="line"><a name="l00382"></a><span class="lineno">  382</span>&#160;    <span class="keywordflow">else</span></div>
<div class="line"><a name="l00383"></a><span class="lineno">  383</span>&#160;        base[size] = <span class="charliteral">&#39;0&#39;</span>;</div>
<div class="line"><a name="l00384"></a><span class="lineno">  384</span>&#160;    base[size+1] = 0;</div>
<div class="line"><a name="l00385"></a><span class="lineno">  385</span>&#160;    size++;</div>
<div class="line"><a name="l00386"></a><span class="lineno">  386</span>&#160;    <span class="keywordflow">if</span> ( node-&gt;<a class="code" href="class_node.html#a219129e2eab7455a4dd0377124c83716">getValue</a>()-&gt;<a class="code" href="struct_entry.html#a5b702ed596424a56ba443f8117c69dc9">letter</a> != 0 )</div>
<div class="line"><a name="l00387"></a><span class="lineno">  387</span>&#160;        printf (<span class="stringliteral">&quot;\n[%c]:%s&quot;</span>,node-&gt;<a class="code" href="class_node.html#a219129e2eab7455a4dd0377124c83716">getValue</a>()-&gt;<a class="code" href="struct_entry.html#a5b702ed596424a56ba443f8117c69dc9">letter</a>, base);</div>
<div class="line"><a name="l00388"></a><span class="lineno">  388</span>&#160;    <span class="keywordflow">if</span> ( node-&gt;<a class="code" href="class_node.html#aec44fee5f55f7a912d398989175537a7">getLeftChild</a> () )</div>
<div class="line"><a name="l00389"></a><span class="lineno">  389</span>&#160;        <a class="code" href="_huffman_8h.html#ae306b5fba7e8c23a8b6ab4902741d446">debugPrintTree</a> (node-&gt;<a class="code" href="class_node.html#aec44fee5f55f7a912d398989175537a7">getLeftChild</a>(), base, size, <span class="keyword">false</span>);</div>
<div class="line"><a name="l00390"></a><span class="lineno">  390</span>&#160;    <span class="keywordflow">if</span> ( node-&gt;<a class="code" href="class_node.html#af235020f301683c3f4ea21b526f82e63">getRightChild</a> () )</div>
<div class="line"><a name="l00391"></a><span class="lineno">  391</span>&#160;        <a class="code" href="_huffman_8h.html#ae306b5fba7e8c23a8b6ab4902741d446">debugPrintTree</a> (node-&gt;<a class="code" href="class_node.html#af235020f301683c3f4ea21b526f82e63">getRightChild</a>(), base, size, <span class="keyword">true</span>);</div>
<div class="line"><a name="l00392"></a><span class="lineno">  392</span>&#160;}</div>
<div class="ttc" id="_huffman_8h_html_a28631afd535a48b8305d60824efc7a80"><div class="ttname"><a href="_huffman_8h.html#a28631afd535a48b8305d60824efc7a80">setBit</a></div><div class="ttdeci">void setBit(void *input, unsigned int bit, bool flag)</div><div class="ttdef"><b>Definition:</b> Huffman.h:78</div></div>
<div class="ttc" id="_huffman_8h_html_a97bd49ee3670e131477f66852fb5f565"><div class="ttname"><a href="_huffman_8h.html#a97bd49ee3670e131477f66852fb5f565">getLowest</a></div><div class="ttdeci">void getLowest(int &amp;lowest, int &amp;preLowest, Node&lt; Entry &gt; *frequency[256], int size)</div><div class="ttdef"><b>Definition:</b> Huffman.h:181</div></div>
<div class="ttc" id="_huffman_8h_html_ae6da2ac39f271e327984f920396d4226"><div class="ttname"><a href="_huffman_8h.html#ae6da2ac39f271e327984f920396d4226">parse</a></div><div class="ttdeci">int parse(char *input)</div></div>
<div class="ttc" id="_huffman_8h_html_abcb57a49a5b5a68e9e34c11c10f15aa9"><div class="ttname"><a href="_huffman_8h.html#abcb57a49a5b5a68e9e34c11c10f15aa9">code</a></div><div class="ttdeci">int code(Node&lt; Entry &gt; *tree, const char *text, char *output, int limit)</div><div class="ttdef"><b>Definition:</b> Huffman.h:349</div></div>
<div class="ttc" id="class_node_html_a3d5bdc1d7ac8f69c04c533363556bff9"><div class="ttname"><a href="class_node.html#a3d5bdc1d7ac8f69c04c533363556bff9">Node::attatchToLeft</a></div><div class="ttdeci">bool attatchToLeft(Node *attachment)</div><div class="ttdef"><b>Definition:</b> node.cpp:153</div></div>
<div class="ttc" id="struct_code_html"><div class="ttname"><a href="struct_code.html">Code</a></div><div class="ttdef"><b>Definition:</b> Huffman.h:40</div></div>
<div class="ttc" id="class_node_html"><div class="ttname"><a href="class_node.html">Node</a></div><div class="ttdef"><b>Definition:</b> node.h:2</div></div>
<div class="ttc" id="class_node_html_aec44fee5f55f7a912d398989175537a7"><div class="ttname"><a href="class_node.html#aec44fee5f55f7a912d398989175537a7">Node::getLeftChild</a></div><div class="ttdeci">Node * getLeftChild()</div><div class="ttdef"><b>Definition:</b> node.cpp:49</div></div>
<div class="ttc" id="_huffman_8h_html_ae29f1caca63c1d4c47fe74e911f5090f"><div class="ttname"><a href="_huffman_8h.html#ae29f1caca63c1d4c47fe74e911f5090f">shrinkImaginaryEntrys</a></div><div class="ttdeci">int shrinkImaginaryEntrys(Node&lt; Entry &gt; *array[256])</div><div class="ttdef"><b>Definition:</b> Huffman.h:152</div></div>
<div class="ttc" id="class_node_html_a219129e2eab7455a4dd0377124c83716"><div class="ttname"><a href="class_node.html#a219129e2eab7455a4dd0377124c83716">Node::getValue</a></div><div class="ttdeci">T * getValue()</div><div class="ttdef"><b>Definition:</b> node.cpp:231</div></div>
<div class="ttc" id="class_node_html_a83094c6b42b1d0f933bd1956c25bf99a"><div class="ttname"><a href="class_node.html#a83094c6b42b1d0f933bd1956c25bf99a">Node::attatchToRight</a></div><div class="ttdeci">bool attatchToRight(Node *attachment)</div><div class="ttdef"><b>Definition:</b> node.cpp:195</div></div>
<div class="ttc" id="_huffman_8h_html_a8ea33aab4a85904900987a1e548f0d51"><div class="ttname"><a href="_huffman_8h.html#a8ea33aab4a85904900987a1e548f0d51">getFrequency</a></div><div class="ttdeci">int getFrequency(Node&lt; Entry &gt; *array[256], const char *text)</div><div class="ttdef"><b>Definition:</b> Huffman.h:110</div></div>
<div class="ttc" id="struct_entry_html_ac969a3e3939cd984949ce994e740340e"><div class="ttname"><a href="struct_entry.html#ac969a3e3939cd984949ce994e740340e">Entry::frequency</a></div><div class="ttdeci">int frequency</div><div class="ttdef"><b>Definition:</b> Huffman.h:29</div></div>
<div class="ttc" id="struct_code_html_aecfe676c82bcd7121c85dc9e228ef7f5"><div class="ttname"><a href="struct_code.html#aecfe676c82bcd7121c85dc9e228ef7f5">Code::code</a></div><div class="ttdeci">char code[4]</div><div class="ttdef"><b>Definition:</b> Huffman.h:43</div></div>
<div class="ttc" id="_huffman_8h_html_a3d514936fcd5754b4e16a701869ceba7"><div class="ttname"><a href="_huffman_8h.html#a3d514936fcd5754b4e16a701869ceba7">getBit</a></div><div class="ttdeci">bool getBit(const void *input, unsigned int bit)</div><div class="ttdef"><b>Definition:</b> Huffman.h:56</div></div>
<div class="ttc" id="class_node_html_af235020f301683c3f4ea21b526f82e63"><div class="ttname"><a href="class_node.html#af235020f301683c3f4ea21b526f82e63">Node::getRightChild</a></div><div class="ttdeci">Node * getRightChild()</div><div class="ttdef"><b>Definition:</b> node.cpp:69</div></div>
<div class="ttc" id="_huffman_8h_html_acf17c7d0746b1093644b6e39073e566c"><div class="ttname"><a href="_huffman_8h.html#acf17c7d0746b1093644b6e39073e566c">fillLetterMap</a></div><div class="ttdeci">void fillLetterMap(std::map&lt; char, Code &gt; *map, Node&lt; Entry &gt; *tree, bool start, char base[4], int size, bool right)</div><div class="ttdef"><b>Definition:</b> Huffman.h:281</div></div>
<div class="ttc" id="struct_entry_html"><div class="ttname"><a href="struct_entry.html">Entry</a></div><div class="ttdef"><b>Definition:</b> Huffman.h:27</div></div>
<div class="ttc" id="_huffman_8h_html_ad9865ee52ece530d7b3b103b0d549007"><div class="ttname"><a href="_huffman_8h.html#ad9865ee52ece530d7b3b103b0d549007">decode</a></div><div class="ttdeci">void decode(Node&lt; Entry &gt; *tree, const char *text, char *output, int limit)</div><div class="ttdef"><b>Definition:</b> Huffman.h:317</div></div>
<div class="ttc" id="_huffman_8h_html_ae306b5fba7e8c23a8b6ab4902741d446"><div class="ttname"><a href="_huffman_8h.html#ae306b5fba7e8c23a8b6ab4902741d446">debugPrintTree</a></div><div class="ttdeci">void debugPrintTree(Node&lt; Entry &gt; *node, char legacy[10], int size, bool right)</div><div class="ttdef"><b>Definition:</b> Huffman.h:374</div></div>
<div class="ttc" id="class_node_html_a2b5dbaadb5ba6ce7c0eb91d6fb3b5354"><div class="ttname"><a href="class_node.html#a2b5dbaadb5ba6ce7c0eb91d6fb3b5354">Node::isTerminal</a></div><div class="ttdeci">bool isTerminal()</div><div class="ttdef"><b>Definition:</b> node.cpp:11</div></div>
<div class="ttc" id="_huffman_8h_html_a9a6e1b4ccad9c9dc4bc226127b0e0ded"><div class="ttname"><a href="_huffman_8h.html#a9a6e1b4ccad9c9dc4bc226127b0e0ded">buildHuffmanTree</a></div><div class="ttdeci">Node&lt; Entry &gt; * buildHuffmanTree(const char *text)</div><div class="ttdef"><b>Definition:</b> Huffman.h:235</div></div>
<div class="ttc" id="struct_entry_html_a5b702ed596424a56ba443f8117c69dc9"><div class="ttname"><a href="struct_entry.html#a5b702ed596424a56ba443f8117c69dc9">Entry::letter</a></div><div class="ttdeci">char letter</div><div class="ttdef"><b>Definition:</b> Huffman.h:30</div></div>
<div class="ttc" id="struct_code_html_aac1f56ad96a7c78ffb27c79ca7048541"><div class="ttname"><a href="struct_code.html#aac1f56ad96a7c78ffb27c79ca7048541">Code::bits</a></div><div class="ttdeci">int bits</div><div class="ttdef"><b>Definition:</b> Huffman.h:42</div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="dir_d522931ffa1371640980b621734a4381.html">Users</a></li><li class="navelem"><a class="el" href="dir_31059516c74acec96613626ef7aefcf7.html">Admin</a></li><li class="navelem"><a class="el" href="dir_75bfd10c97e1a12326c67b95924ea7f1.html">Desktop</a></li><li class="navelem"><a class="el" href="dir_8b3ae1d7c0b3c0d135a7fe7cf034a6a1.html">issue</a></li><li class="navelem"><a class="el" href="dir_cffd1e001ee2a87eebf0bd2a849b668e.html">huffman-homework</a></li><li class="navelem"><a class="el" href="_huffman_8h.html">Huffman.h</a></li>
    <li class="footer">Generated on Sat Sep 6 2014 07:57:43 for Huffman-homework by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.5 </li>
  </ul>
</div>
</body>
</html>
